Finite rigid sets in flip graphs
نویسندگان
چکیده
We show that for most pairs of surfaces, there exists a finite subgraph the flip graph first surface so any injective homomorphism this into second can be extended uniquely to an between two graphs. Combined with result Aramayona-Koberda-Parlier, implies such set is induced by embedding surfaces.
منابع مشابه
Exhausting Curve Complexes by Finite Rigid Sets
Let S be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex C(S) by a sequence of finite rigid sets.
متن کاملOn Independent Star Sets in Finite Graphs
Let G be a finite graph with μ as an eigenvalue of multiplicity k. A star set for μ is a set X of k vertices in G such that μ is not an eigenvalue of G−X. We investigate independent star sets of largest possible size in a variety of situations. We note connections with symmetric designs, codes, strongly regular graphs, and graphs with least eigenvalue −2. AMS Classification: 05C50
متن کاملEulerian edge sets in locally finite graphs
In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.
متن کاملA Displacement Metric for Finite Sets of Rigid Body Displacements
Venkatesh Venkataramanujam Robotics & Spatial Systems Laboratory Department of Mechanical and Aerospace Engineering Florida Institute of Technology Melbourne, Florida 32901 Email: [email protected] Pierre Larochelle∗ Robotics & Spatial Systems Laboratory Department of Mechanical and Aerospace Engineering Florida Institute of Technology Melbourne, Florida 32901 Email: [email protected] Information ...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2021
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8407